Grover’s quantum search algorithm for an arbitrary initial amplitude distribution
نویسندگان
چکیده
منابع مشابه
Grover’s quantum search algorithm for an arbitrary initial amplitude distribution
Eli Biham, Ofer Biham, David Biron, Markus Grassl, and Daniel A. Lidar Computer Science Department, Technion, Haifa 32000, Israel Racah Institute of Physics, The Hebrew University, Jerusalem 91904, Israel Institut für Algorithmen und Kognitive Systeme, Universität Karlsruhe, Am Fasanengarten 5, D-76128 Karlsruhe, Germany Department of Chemistry, University of California at Berkeley, Berkeley, C...
متن کاملGeneralized Grover Search Algorithm for Arbitrary Initial Amplitude Distribution
Grover’s algorithm for quantum searching of a database is generalized to deal with arbitrary initial amplitude distributions. First order linear difference equations are found for the time evolution of the amplitudes of the r marked and N − r unmarked states. These equations are solved exactly. An expression for the optimal measurement time T ∼ O( √ N/r) is derived which is shown to depend only...
متن کاملGrover’s quantum search algorithm for an arbitrary initial mixed state
The Grover quantum search algorithm is generalized to deal with an arbitrary mixed initial state. The probability to measure a marked state as a function of time is calculated, and found to depend strongly on the specific initial state. The form of the function, though, remains as it is in the case of initial pure state. We study the role of the von Neumann entropy of the initial state, and sho...
متن کاملQuantum speed limit for arbitrary initial states
The minimal time a system needs to evolve from an initial state to its one orthogonal state is defined as the quantum speed limit time, which can be used to characterize the maximal speed of evolution of a quantum system. This is a fundamental question of quantum physics. We investigate the generic bound on the minimal evolution time of the open dynamical quantum system. This quantum speed limi...
متن کاملAn alternate algorithm for directed quantum search
We present a new algorithm for directed quantum search, which is superior to the Phase-π/3 search algorithm [5] in several aspects. In particular, our algorithm does not require complex phases and achieves the optimal reduction in error probability, from ǫ to ǫ2q+1, for all positive integer values q of oracle queries. (The Phase-π/3 algorithm, requires q = (3n − 1)/2, with n a positive integer....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 1999
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.60.2742